All-Optical Pseudorandom Binary Sequence (PRBS) Generator Using The Hardlimiters
نویسندگان
چکیده
منابع مشابه
A Multi Maximal Length Multi Time Period Pseudorandom Bit Sequence (PRBS) Generator
A novel method of generating a pseudorandom binary sequence (PRBS) test signal generator is presented. A traditional PRBS generator uses a linear feedback shift register (LFSR) which generates a single maximum length sequence pattern having a fixed period. In this paper, three shift registers with feedback connections are employed in which the preset inputs of the shift registers are changed on...
متن کاملAll-optical binary counter.
We experimentally demonstrate an all-optical binary counter composed of four semiconductor optical amplifier based all-optical switching gates. The time-of-flight optical circuit operates with bit-differential delays between the exclusive-OR gate used for modulo-2 binary addition and the AND gate used for binary carry detection. A movie of the counter operating in real time is presented.
متن کاملAn Optimized Pseudorandom Generator using Packed Matrices
Most cryptographic services and information security protocols require a dependable source of random data; pseudorandom generators are convenient and efficient for this application working as one of the basic foundation blocks on which to build the required security infrastructure. We propose a modification of a previously published matricial pseudorandom generator that significantly improves p...
متن کاملLikelihood that a pseudorandom sequence generator has optimal properties
The authors prove that the probability of choosing a nonlinear filter of m-sequences with optimal properties, that is, maximum period and maximum linear complexity, tends assymptotically to 1 as the linear feedback shift register length increases. Pseudorandom sequence generators have multiple applications in radar systems, simulation, error-correcting codes, spread-spectrum communication syste...
متن کاملThe binary primes sequence for computational hardening of pseudorandom sequences
This paper proposes the use of the binary primes sequence to strengthen pseudorandom (PN) decimal sequences for cryptography applications. The binary primes sequence is added to the PN decimal sequence (where one can choose from many arbitrary shift values) and it is shown that the sum sequence has improved autocorrelation properties besides being computationally hard. Also, an analysis on the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JES. Journal of Engineering Sciences
سال: 2013
ISSN: 2356-8550
DOI: 10.21608/jesaun.2013.114701